Nearly optimal three dimensional layout of hypercube networks
نویسندگان
چکیده
منابع مشابه
Nearly Optimal Three Dimensional Layout of Hypercube Networks
In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the ...
متن کاملOptimal three-dimensional layout of interconnection networks
The main bene1ts of a three-dimensional layout of interconnection networks are the savings in material (measured as volume) and the shortening of wires. The result presented in this paper is a general formula for calculating a lower bound on the volume. Moreover, for butter3y and X-tree networks we show layouts optimizing the maximum wire length and whose upper bounds on the volume are close to...
متن کاملOn three-dimensional layout of pyramid networks
The pyramid networks are well-known as suitable structures for parallel computations such as image processing. This paper shows a practical 3D VLSI layout of the N -vertex pyramid network with volume O(N) and wire-length O( 3 √ N). Since the known best lower bounds for the volume and wire-length of a 3D layout for an N -vertex pyramid network are Ω(N) and Ω( 3 √ N/ log N), respectively, the vol...
متن کاملOn Three-Dimensional Layout of Interconnection Networks (Extended Abstract) *
Abs t r ac t . In this paper we deal with the layout of interconnection networks on three-dimensional grids. In particular, in the first, part we prove a general formula for calculating an exact value for the lower bound on the volume. Then we introduce the new notion of k-3D double channel routing and we use it to exhibit an optimal three-dimensional layout for butterfly networks. Finally, we ...
متن کاملOn Three-dimensional Layout of De Bruijn Networks
The de Bruijn networks are well-known as suitable structures for parallel computations such as FFT. This paper shows an efficient D VLSI layout of the de Bruijn network with optimal volume and near optimal wire-length. Our layout consists of a number of copies of a single 2D VLSI layout for a subnetwork of the de Bruijn network.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2005
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20089